0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : vampire --ignore_missing on --mode portfolio/casc [--schedule casc_hol_2020] -p tptp -om szs -t %d %s
0.11/0.33	% Computer : n029.cluster.edu
0.11/0.33	% Model    : x86_64 x86_64
0.11/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.11/0.33	% Memory   : 8042.1875MB
0.11/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.11/0.33	% CPULimit   : 960
0.11/0.33	% WCLimit    : 120
0.11/0.33	% DateTime   : Tue Aug  9 05:29:09 EDT 2022
0.11/0.33	% CPUTime    : 
0.11/0.33	This is a THF_ problem
0.11/0.33	Running vampire --ignore_missing on --mode portfolio --schedule casc_hol_2020 -p tptp -om szs --cores 8 -t 120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.11/0.34	% (26149)Running in auto input_syntax mode. Trying TPTP
0.11/0.39	% (26151)lrs-11_4:1_afp=4000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=2.0:anc=none:br=off:gs=on:lwlo=on:nm=64:nwc=3:stl=30:urr=on_2 on theBenchmark
0.11/0.39	% (26157)lrs+4_3_av=off:br=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:nm=0:newcnf=on:nwc=1:stl=30:sp=occurrence:urr=on_32 on theBenchmark
0.11/0.39	% (26154)lrs+1010_8_add=off:afp=100000:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afq=1.0:amm=off:anc=none:irw=on:nm=16:newcnf=on:nwc=1.1:nicw=on:stl=30:sp=reverse_arity:urr=on_13 on theBenchmark
0.11/0.39	% (26157)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.11/0.39	% (26154)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.11/0.39	% (26153)dis+10_128_acc=on:add=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afp=4000:afq=1.4:amm=off:bd=preordered:cond=on:fsr=off:fde=unused:gs=on:gsem=on:irw=on:lma=on:nm=64:nwc=1.2:nicw=on:sos=on:sp=occurrence:updr=off:uhcvi=on_2 on theBenchmark
0.11/0.39	% (26155)ott+1002_8:1_add=off:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:afr=on:afp=100000:afq=1.1:amm=off:anc=none:bd=off:bs=unit_only:fsr=off:gs=on:gsem=off:nm=32:nwc=10:sp=occurrence:urr=on:updr=off_14 on theBenchmark
0.11/0.39	% (26156)lrs+1011_5:1_acc=on:csup=on:inj=on:chr=on:cases=on:cnfonf=eager:amm=off:anc=all_dependent:bd=off:ccuc=small_ones:fde=unused:gs=on:gsaa=full_model:gsem=off:lcm=predicate:lwlo=on:nm=6:newcnf=on:nwc=2.5:stl=30:sp=occurrence:updr=off_3 on theBenchmark
0.11/0.39	% (26156)WARNING: Not using newCnf currently not compatible with polymorphic/higher-order inputs.
0.11/0.39	% (26151)First to succeed.
0.11/0.39	% (26153)Also succeeded, but the first one will report.
0.18/0.39	% (26154)Also succeeded, but the first one will report.
0.18/0.40	% (26151)Refutation found. Thanks to Tanya!
0.18/0.40	% SZS status Theorem for theBenchmark
0.18/0.40	% SZS output start Proof for theBenchmark
0.18/0.40	thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
0.18/0.40	thf(func_def_3, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
0.18/0.40	thf(func_def_10, type, kCOMB: !>[X0: $tType, X1: $tType]:(X0 > X1 > X0)).
0.18/0.40	thf(func_def_11, type, bCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X1 > X2) > (X0 > X1) > X0 > X2)).
0.18/0.40	thf(func_def_12, type, vAND: $o > $o > $o).
0.18/0.40	thf(func_def_13, type, vOR: $o > $o > $o).
0.18/0.40	thf(func_def_14, type, vIMP: $o > $o > $o).
0.18/0.40	thf(func_def_15, type, vNOT: $o > $o).
0.18/0.40	thf(func_def_16, type, vEQ: !>[X0: $tType]:(X0 > X0 > $o)).
0.18/0.40	thf(func_def_17, type, sCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > X2) > (X0 > X1) > X0 > X2)).
0.18/0.40	thf(func_def_18, type, cCOMB: !>[X0: $tType, X1: $tType, X2: $tType]:((X0 > X1 > X2) > X1 > X0 > X2)).
0.18/0.40	thf(func_def_19, type, iCOMB: !>[X0: $tType]:(X0 > X0)).
0.18/0.40	thf(f134,plain,(
0.18/0.40	  $false),
0.18/0.40	  inference(avatar_sat_refutation,[],[f21,f30,f34,f35,f38,f79,f130,f133])).
0.18/0.40	thf(f133,plain,(
0.18/0.40	  ~spl0_1 | ~spl0_3),
0.18/0.40	  inference(avatar_contradiction_clause,[],[f132])).
0.18/0.40	thf(f132,plain,(
0.18/0.40	  $false | (~spl0_1 | ~spl0_3)),
0.18/0.40	  inference(trivial_inequality_removal,[],[f131])).
0.18/0.40	thf(f131,plain,(
0.18/0.40	  ($true = $false) | (~spl0_1 | ~spl0_3)),
0.18/0.40	  inference(forward_demodulation,[],[f16,f25])).
0.18/0.40	thf(f25,plain,(
0.18/0.40	  (cB = $false) | ~spl0_3),
0.18/0.40	  inference(avatar_component_clause,[],[f23])).
0.18/0.40	thf(f23,plain,(
0.18/0.40	  spl0_3 <=> (cB = $false)),
0.18/0.40	  introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
0.18/0.40	thf(f16,plain,(
0.18/0.40	  (cB = $true) | ~spl0_1),
0.18/0.40	  inference(avatar_component_clause,[],[f14])).
0.18/0.40	thf(f14,plain,(
0.18/0.40	  spl0_1 <=> (cB = $true)),
0.18/0.40	  introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
0.18/0.40	thf(f130,plain,(
0.18/0.40	  ~spl0_2 | ~spl0_3 | ~spl0_5),
0.18/0.40	  inference(avatar_contradiction_clause,[],[f129])).
0.18/0.40	thf(f129,plain,(
0.18/0.40	  $false | (~spl0_2 | ~spl0_3 | ~spl0_5)),
0.18/0.40	  inference(trivial_inequality_removal,[],[f127])).
0.18/0.40	thf(f127,plain,(
0.18/0.40	  ($true = $false) | (~spl0_2 | ~spl0_3 | ~spl0_5)),
0.18/0.40	  inference(backward_demodulation,[],[f20,f114])).
0.18/0.40	thf(f114,plain,(
0.18/0.40	  ( ! [X2 : $o] : (($false = X2)) ) | (~spl0_2 | ~spl0_3 | ~spl0_5)),
0.18/0.40	  inference(not_proxy_clausification,[],[f113])).
0.18/0.40	thf(f113,plain,(
0.18/0.40	  ( ! [X2 : $o] : (($true = vAPP($o,$o,vNOT,X2))) ) | (~spl0_2 | ~spl0_3 | ~spl0_5)),
0.18/0.40	  inference(boolean_simplification,[],[f112])).
0.18/0.40	thf(f112,plain,(
0.18/0.40	  ( ! [X2 : $o] : (($true = vAPP($o,$o,vAPP($o,sTfun($o,$o),vIMP,X2),$false))) ) | (~spl0_2 | ~spl0_3 | ~spl0_5)),
0.18/0.40	  inference(trivial_inequality_removal,[],[f111])).
0.18/0.40	thf(f111,plain,(
0.18/0.40	  ( ! [X2 : $o] : (($true != $true) | ($true = vAPP($o,$o,vAPP($o,sTfun($o,$o),vIMP,X2),$false))) ) | (~spl0_2 | ~spl0_3 | ~spl0_5)),
0.18/0.40	  inference(boolean_simplification,[],[f87])).
0.18/0.40	thf(f87,plain,(
0.18/0.40	  ( ! [X2 : $o] : (($true != vAPP($o,$o,vAPP($o,sTfun($o,$o),vIMP,X2),$true)) | ($true = vAPP($o,$o,vAPP($o,sTfun($o,$o),vIMP,X2),$false))) ) | (~spl0_2 | ~spl0_3 | ~spl0_5)),
0.18/0.40	  inference(primitive_instantiation,[],[f81])).
0.18/0.40	thf(f81,plain,(
0.18/0.40	  ( ! [X0 : $o > $o] : (($true != vAPP($o,$o,X0,$true)) | ($true = vAPP($o,$o,X0,$false))) ) | (~spl0_2 | ~spl0_3 | ~spl0_5)),
0.18/0.40	  inference(backward_demodulation,[],[f80,f20])).
0.18/0.40	thf(f80,plain,(
0.18/0.40	  ( ! [X0 : $o > $o] : (($true = vAPP($o,$o,X0,$false)) | (vAPP($o,$o,X0,cA) != $true)) ) | (~spl0_3 | ~spl0_5)),
0.18/0.40	  inference(backward_demodulation,[],[f33,f25])).
0.18/0.40	thf(f33,plain,(
0.18/0.40	  ( ! [X0 : $o > $o] : ((vAPP($o,$o,X0,cB) = $true) | (vAPP($o,$o,X0,cA) != $true)) ) | ~spl0_5),
0.18/0.40	  inference(avatar_component_clause,[],[f32])).
0.18/0.40	thf(f32,plain,(
0.18/0.40	  spl0_5 <=> ! [X0 : $o > $o] : ((vAPP($o,$o,X0,cB) = $true) | (vAPP($o,$o,X0,cA) != $true))),
0.18/0.40	  introduced(avatar_definition,[new_symbols(naming,[spl0_5])])).
0.18/0.40	thf(f20,plain,(
0.18/0.40	  (cA = $true) | ~spl0_2),
0.18/0.40	  inference(avatar_component_clause,[],[f18])).
0.18/0.40	thf(f18,plain,(
0.18/0.40	  spl0_2 <=> (cA = $true)),
0.18/0.40	  introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
0.18/0.40	thf(f79,plain,(
0.18/0.40	  ~spl0_1 | ~spl0_4 | ~spl0_5),
0.18/0.40	  inference(avatar_contradiction_clause,[],[f78])).
0.18/0.40	thf(f78,plain,(
0.18/0.40	  $false | (~spl0_1 | ~spl0_4 | ~spl0_5)),
0.18/0.40	  inference(trivial_inequality_removal,[],[f42])).
0.18/0.40	thf(f42,plain,(
0.18/0.40	  ($true = $false) | (~spl0_1 | ~spl0_4 | ~spl0_5)),
0.18/0.40	  inference(leibniz_equality_elimination,[],[f41])).
0.18/0.40	thf(f41,plain,(
0.18/0.40	  ( ! [X0 : $o > $o] : (($true != vAPP($o,$o,X0,$false)) | ($true = vAPP($o,$o,X0,$true))) ) | (~spl0_1 | ~spl0_4 | ~spl0_5)),
0.18/0.40	  inference(backward_demodulation,[],[f39,f16])).
0.18/0.40	thf(f39,plain,(
0.18/0.40	  ( ! [X0 : $o > $o] : (($true != vAPP($o,$o,X0,$false)) | (vAPP($o,$o,X0,cB) = $true)) ) | (~spl0_4 | ~spl0_5)),
0.18/0.40	  inference(forward_demodulation,[],[f33,f29])).
0.18/0.40	thf(f29,plain,(
0.18/0.40	  (cA = $false) | ~spl0_4),
0.18/0.40	  inference(avatar_component_clause,[],[f27])).
0.18/0.40	thf(f27,plain,(
0.18/0.40	  spl0_4 <=> (cA = $false)),
0.18/0.40	  introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
0.18/0.40	thf(f38,plain,(
0.18/0.40	  ~spl0_2 | ~spl0_4),
0.18/0.40	  inference(avatar_contradiction_clause,[],[f37])).
0.18/0.40	thf(f37,plain,(
0.18/0.40	  $false | (~spl0_2 | ~spl0_4)),
0.18/0.40	  inference(trivial_inequality_removal,[],[f36])).
0.18/0.40	thf(f36,plain,(
0.18/0.40	  ($true = $false) | (~spl0_2 | ~spl0_4)),
0.18/0.40	  inference(forward_demodulation,[],[f20,f29])).
0.18/0.40	thf(f35,plain,(
0.18/0.40	  spl0_1 | spl0_4 | spl0_5),
0.18/0.40	  inference(avatar_split_clause,[],[f10,f32,f27,f14])).
0.18/0.40	thf(f10,plain,(
0.18/0.40	  ( ! [X0 : $o > $o] : ((vAPP($o,$o,X0,cB) = $true) | (vAPP($o,$o,X0,cA) != $true) | (cA = $false) | (cB = $true)) )),
0.18/0.40	  inference(binary_proxy_clausification,[],[f7])).
0.18/0.40	thf(f7,plain,(
0.18/0.40	  ( ! [X0 : $o > $o] : ((vAPP($o,$o,X0,cB) = $true) | (vAPP($o,$o,X0,cA) != $true) | (cA = cB)) )),
0.18/0.40	  inference(cnf_transformation,[],[f6])).
0.18/0.40	thf(f6,plain,(
0.18/0.40	  (cA != cB) & (! [X0 : $o > $o] : ((vAPP($o,$o,X0,cB) = $true) | (vAPP($o,$o,X0,cA) != $true)) | (cA = cB))),
0.18/0.40	  inference(ennf_transformation,[],[f5])).
0.18/0.40	thf(f5,plain,(
0.18/0.40	  ~((! [X0 : $o > $o] : ((vAPP($o,$o,X0,cA) = $true) => (vAPP($o,$o,X0,cB) = $true)) | (cA = cB)) => (cA = cB))),
0.18/0.40	  inference(fool_elimination,[],[f4])).
0.18/0.40	thf(f4,plain,(
0.18/0.40	  ~((! [X0 : $o > $o] : (vAPP($o,$o,X0,cA) => vAPP($o,$o,X0,cB)) | (cA <=> cB)) => (cA = cB))),
0.18/0.40	  inference(rectify,[],[f2])).
0.18/0.40	thf(f2,negated_conjecture,(
0.18/0.40	  ~((! [X0 : $o > $o] : (vAPP($o,$o,X0,cA) => vAPP($o,$o,X0,cB)) | (cA <=> cB)) => (cA = cB))),
0.18/0.40	  inference(negated_conjecture,[],[f1])).
0.18/0.40	thf(f1,conjecture,(
0.18/0.40	  (! [X0 : $o > $o] : (vAPP($o,$o,X0,cA) => vAPP($o,$o,X0,cB)) | (cA <=> cB)) => (cA = cB)),
0.18/0.40	  file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown)).
0.18/0.40	thf(f34,plain,(
0.18/0.40	  spl0_3 | spl0_2 | spl0_5),
0.18/0.40	  inference(avatar_split_clause,[],[f9,f32,f18,f23])).
0.18/0.40	thf(f9,plain,(
0.18/0.40	  ( ! [X0 : $o > $o] : ((vAPP($o,$o,X0,cB) = $true) | (vAPP($o,$o,X0,cA) != $true) | (cA = $true) | (cB = $false)) )),
0.18/0.40	  inference(binary_proxy_clausification,[],[f7])).
0.18/0.40	thf(f30,plain,(
0.18/0.40	  spl0_3 | spl0_4),
0.18/0.40	  inference(avatar_split_clause,[],[f12,f27,f23])).
0.18/0.40	thf(f12,plain,(
0.18/0.40	  (cA = $false) | (cB = $false)),
0.18/0.40	  inference(binary_proxy_clausification,[],[f8])).
0.18/0.40	thf(f8,plain,(
0.18/0.40	  (cA != cB)),
0.18/0.40	  inference(cnf_transformation,[],[f6])).
0.18/0.40	thf(f21,plain,(
0.18/0.40	  spl0_1 | spl0_2),
0.18/0.40	  inference(avatar_split_clause,[],[f11,f18,f14])).
0.18/0.40	thf(f11,plain,(
0.18/0.40	  (cA = $true) | (cB = $true)),
0.18/0.40	  inference(binary_proxy_clausification,[],[f8])).
0.18/0.40	% SZS output end Proof for theBenchmark
0.18/0.40	% (26151)------------------------------
0.18/0.40	% (26151)Version: Vampire 4.7 (commit 2d02e4655 on 2022-07-11 21:15:24 +0200)
0.18/0.40	% (26151)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
0.18/0.40	% (26151)Termination reason: Refutation
0.18/0.40	
0.18/0.40	% (26151)Memory used [KB]: 10234
0.18/0.40	% (26151)Time elapsed: 0.006 s
0.18/0.40	% (26151)------------------------------
0.18/0.40	% (26151)------------------------------
0.18/0.40	% (26149)Success in time 0.059 s
0.18/0.40	EOF